The number of blocks with a given defect group
نویسندگان
چکیده
منابع مشابه
The number of permutations with a given number of sequences
P (n, s) denotes the number of permutations of 1, 2,. .. n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P (n, s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly and also obtain explicit expressions for P (n, s) and its fixed-s generating function us(x).
متن کاملOn defect groups for generalized blocks of the symmetric group
In a paper of 2003, B. Külshammer, J. B. Olsson and G. R. Robinson defined l-blocks for the symmetric groups, where l > 1 is an arbitrary integer. In this paper, we give a definition for the defect group of the principal l-block. We then check that, in the Abelian case, we have an analogue of one of M. Broué’s conjectures.
متن کاملThe minimal number with a given number of divisors
A number n is said to be ordinary if the smallest number with exactly n divisors is p q1−1 1 · · · p qa−1 a where q1 · · · qa is the prime factorization of n and q1 ≥ . . . ≥ qa (and where pk denotes the k-th prime). We show here that all square–free numbers are ordinary and that the set of ordinary numbers has natural density one.
متن کاملan investigation of the types of text reduction in subtitling: a case study of the persian film gilaneh with english subtitles
چکیده ندارد.
15 صفحه اولOn the Number of Subsequences with a Given Sum in a Finite Abelian Group
Suppose G is a finite abelian group and S is a sequence of elements in G. For any element g of G, let Ng(S) denote the number of subsequences of S with sum g. The purpose of this paper is to investigate the lower bound for Ng(S). In particular, we prove that either Ng(S) = 0 or Ng(S) ≥ 2 |S|−D(G)+1, where D(G) is the smallest positive integer l such that every sequence over G of length at least...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1983
ISSN: 0021-8693
DOI: 10.1016/0021-8693(83)90091-1